feat: prove that the Buchi congruence has the saturation property#325
feat: prove that the Buchi congruence has the saturation property#325fmontesi merged 59 commits intoleanprover:mainfrom
Conversation
…n of omega-languages of a special form
chenson2018
left a comment
There was a problem hiding this comment.
As I mention I've not fully reviewed buchiFamily_saturation, but here is an initial review.
fmontesi
left a comment
There was a problem hiding this comment.
Looks pretty good to me, just minor things.
|
My delay in approving this is because of |
|
We can work on this after I get back from my trip on March 12. I don't have my laptop with me now. |
|
@chenson2018 Could you elaborate on your last comment? I'm not sure I understand it. |
|
@ctchou Let me take another look and at least add the cleanups to |
|
I don't think that's possible. In essence, here we are starting with something like |
|
@ctchou Please see my last commit and let me know what you think. My aim here was to as much as possible organize things into as few calls to (There is one particularly problematic call to grind I will point out separately.) |
chenson2018
left a comment
There was a problem hiding this comment.
Thanks for the patience with a longer review!
|
@chenson2018 It's a pleasure working with you. |
…anprover#325) This PR proves that the Buchi congruence introduced in leanprover#278 has the saturation property defined in `Cslib.Foundations.Data.Set.Saturation`. More precisely, the family of omega-languages of the form `U * V^ω`, where `U` and `V` are equivalence classes of the Buchi congruence, saturates the omega-language accepted by the underlying Buchi automaton. This proof is the hardest step in proving the closure of ω-regular languages under complementation and explains why the Buchi congruence is defined the way it is. Some miscellaneous results about LTS and infinite sequences that are needed by the proof are also added. --------- Co-authored-by: Fabrizio Montesi <famontesi@gmail.com> Co-authored-by: Chris Henson <chrishenson.net@gmail.com>
This PR proves that the Buchi congruence introduced in #278 has the saturation property defined in
Cslib.Foundations.Data.Set.Saturation. More precisely, the family of omega-languages of the formU * V^ω, whereUandVare equivalence classes of the Buchi congruence, saturates the omega-language accepted by the underlying Buchi automaton. This proof is the hardest step in proving the closure of ω-regular languages under complementation and explains why the Buchi congruence is defined the way it is. Some miscellaneous results about LTS and infinite sequences that are needed by the proof are also added.